Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Athisayanathan, S.
- Algorithms to Find Vertex-to-Clique Center in a Graph using BC-Representation
Abstract Views :142 |
PDF Views:4
Authors
Affiliations
1 Department of Computer Science, Alagappa Government Arts College, Karaikudi - 630003, IN
2 Research Department of Mathematics, St. Xaviers College (Autonomous), Palayamkottai − 627002, IN
3 Ananda College, Devakottai, IN
1 Department of Computer Science, Alagappa Government Arts College, Karaikudi - 630003, IN
2 Research Department of Mathematics, St. Xaviers College (Autonomous), Palayamkottai − 627002, IN
3 Ananda College, Devakottai, IN
Source
International Journal of Advanced Networking and Applications, Vol 4, No 6 (2013), Pagination: 1809-1811Abstract
In this paper, we introduce algorithms to find the vertex-to-clique (or (V, ζ ))-distance d(v, C ) between a vertex v and a clique C in a graph G, (V, ζ )-eccentricity e1 (v) of a vertex v, and (V, ζ )-center Z1(G) of a graph G usingBC - representation. Moreover, the algorithms are proved for their correctness and analyzed for their time complexity.Keywords
Clique, Distance, Eccentricity, Radius, Center, Binary Count.- Algorithm to Find Clique Graph
Abstract Views :183 |
PDF Views:2
Authors
Affiliations
1 Department of Computer Science, Alagappa Government Arts College, Karaikudi 630003, IN
2 Research Department of Mathematics, St. Xaviers College(Autonomous), Palayamkottai 627002, IN
3 Ananda College, Devakottai, IN
1 Department of Computer Science, Alagappa Government Arts College, Karaikudi 630003, IN
2 Research Department of Mathematics, St. Xaviers College(Autonomous), Palayamkottai 627002, IN
3 Ananda College, Devakottai, IN
Source
International Journal of Advanced Networking and Applications, Vol 4, No 1 (2012), Pagination: 1501-1502Abstract
Let V = {1, 2, 3, …, n} be the vertex set of a graph G, ℘ (V) the powerset of V and A ∈ ℘ (V ). Then A can be represented as an ordered n-tuple (x1x2x3…xn) where xi = 1 if i ∈ A, otherwise xi = 0 (1≤ i ≤ n). This representation is called binary count (or BC) representation of a set A and denoted as BC(A). Given a graph G of order n, every integer m in S = {0, 1, 2, …, 2n-1} corresponds to a subset A of V and vice versa. In this paper we introduce and discuss a sequential algorithm to find the clique graph K(G) of a graph G using the BC representation.Keywords
Binary Count, Clique, Clique Graph, Powerset.- Algorithm to Find all Cliques in a Graph
Abstract Views :145 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science, St. Xavier’s College (Autonomous), Palayamkottai-627002, IN
2 Research Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai-627002, IN
1 Department of Computer Science, St. Xavier’s College (Autonomous), Palayamkottai-627002, IN
2 Research Department of Mathematics, St. Xavier’s College (Autonomous), Palayamkottai-627002, IN